Reducing Deep Pushdown Automata
نویسنده
چکیده
This contribution presents reducing variant of the deep pushdown automata. Deep pushdown automata is a new generalization of the classical pushdown automata. Basic idea of the modification consists of allowing these automata to access more deeper parts of pushdown and reducing strings to non-input symbols in the pushdown. It works similarly to bottom-up analysis simulation of context-free grammars in the classical pushdown automata. Further, this paper presents results of equivalence of reducing deep pushdown automata with n-limited state grammars and infinite hierarchy of language families based on that.
منابع مشابه
On the power of deep pushdown stacks
Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, NPSDSs, based around assignments, while-loops and non-deterministic guessing but with access to a deep pushdown stack which, apart from having the usual push and pop instructions, also has deep-push instructions which allow elements to be pushed to stack location...
متن کاملOn Quantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...
متن کاملOn the Complexity of Bisimulation Problems for Pushdown Automata
All bisimulation problems for pushdown automata are at least PSPACE-hard. In particular, we show that (1) Weak bisimilarity of pushdown automata and nite automata is PSPACE-hard, even for a small xed nite automaton, (2) Strong bisimilarity of pushdown au-tomata and nite automata is PSPACE-hard, but polynomial for every xed nite automaton, (3) Regularity ((niteness) of pushdown automata w.r.t. w...
متن کاملOn the Expressive Power of 2-Stack Visibly Pushdown Automata
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La Torre, Madhusudan, and Parlato, who exploit the concept of visibility further to obtain a rich pushdown-automata cla...
متن کاملA Logical Characterization for Dense-Time Visibly Pushdown Automata
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by making the call-return edges visible and by making the clock-reset operation visible, respectively—recover decidabili...
متن کامل